Mean-squared error analysis of the binormalized data-reusing LMS algorithm using a discrete-angular-distribution model for the input signal
نویسندگان
چکیده
Providing a quantitative mean-squared-error analysis of adaptation algorithms is of great importance for determining their usefulness and for comparison with other algorithms. However, when the algorithm reutilizes previous data, such analysis becomes very involved as the independence assumption cannot be used. In this paper, a thorough mean-squared-error analysis of the binormalized data-reusing LMS algorithm is carried out. The analysis is based on a simplified model for the input-signal vector, assuming independence between the continuous radial probability distribution and the discrete angular probability distribution. Throughout the analysis only parallel and orthogonal input-signal vectors are used in order to obtain a closed-form formula for the excess meansquared error. The formula agrees closely with simulation results even when the input-signal vector is a delay line. Furthermore, the analysis can be readily extended to other algorithms with expected similar accuracy.
منابع مشابه
Mean-squared Error Analysis of the Binormalized Data-reusing Lms Algorithm Using a Dlscrete-angular-distribution Model for the Input
plied successfully to the analysis of the normalized LMS (NLMS) Providing a quantitative mean-squared-error analysis of adaptation algorithms is of great importance for determining their usefulness and for comparison with other algorithms. However, when the algorithm reutilizes previous data, such analysis becomes very involved as the independence assumption cannot be used. In this paper, a tho...
متن کاملColored Input - Signal Analysis of Normalized Data - Reusing LMS Algorithms
In this paper, a simplified model is used to qualitatively and quantitatively analyze two normalized data-reusing LMS algorithms when the input sequence is colored. The proposed approach relates the eigenvalue distribution of the input-signal autocorrelation matrix with probabilities of occurrence of subsequent parallel or orthogonal input-signal vectors. Closed-form formulas that describe stea...
متن کاملThe Binormalized Data-Reusing LMS Algorithm
A new algorithm, the binormalized data-reusing least mean squares (LMS) algorithm is presented. The new algorithm has been found to converge faster than other LMS-like algorithms, such as the Normalized LMS algorithm and several data-reusing LMS algorithms, when the input signal is highly correlated. The computational complexity of this new algorithm is only slightly higher than a recently prop...
متن کاملA Family of Selective Partial Update Affine Projection Adaptive Filtering Algorithms
In this paper we present a general formalism for the establishment of the family of selective partial update affine projection algorithms (SPU-APA). The SPU-APA, the SPU regularized APA (SPU-R-APA), the SPU partial rank algorithm (SPU-PRA), the SPU binormalized data reusing least mean squares (SPU-BNDR-LMS), and the SPU normalized LMS with orthogonal correction factors (SPU-NLMS-OCF) algorithms...
متن کاملPerformance analysis of the DCT-LMS adaptive filtering algorithm
This paper presents the convergence analysis result of the discrete cosine transform-least-mean-square (DCT-LMS) adaptive "ltering algorithm which is based on a well-known interpretation of the variable stepsize algorithm. The time-varying stepsize of the DCT-LMS algorithm is implemented by the modi"ed power estimator to redistribute the spread power after the DCT. The performance analysis is c...
متن کامل